- Map
Collection of key/value associations
Keys are unique
In a TreeMap, keys are sorted

We used a HashMap for the concordances problem

Plan:
1. Populate the hashmap based on the user's input
2. Display concordances on the screen

Example#1: Concordances

- Queue
PriorityQueue implements the Queue interface (Collection of sorted values)

Priority Queue (PQ) sorting algorithm

3	5	2	1 (n elements)
PQ:



Step#1: Insert the values of the unsorted list into the PQ through n PQ insert operations

Step#2: Get the values from the PQ through n PQ remove operations

1	2	3	5

Example#2: Priority Queue Sorting





